The Minimum Equivalent DNF Problem and Shortest Implicants

نویسنده

  • Christopher Umans
چکیده

We prove that the Minimum Equivalent DNF problem is p2-complete, resolving a conjecture due to Stockmeyer. The proof involves as an intermediate step a variant of a related problem in logic minimization, namely, that of finding the shortest implicant of a Boolean function. We also obtain certain results concerning the complexity of the Shortest Implicant problem that may be of independent interest. When the input is a formula, the Shortest Implicant problem is p2complete, and p2-hard to approximate to within an n1=2 factor. When the input is a circuit, approximation is p2hard to within an n1 factor. However, when the input is a DNF formula, the Shortest Implicant problem cannot be p2-complete unless p2 = NP[log2 n]NP.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boolean functions with long prime implicants

In this short note we introduce a class of Boolean functions defined by a minimum length of its prime implicants. We show that given a DNF one can test in polynomial time whether it represents a function from this class. Moreover, in case that the answer is affirmative we present a polynomial time algorithm which outputs a shortest DNF representation of the given function. Therefore the defined...

متن کامل

Complexity of DNF minimization and isomorphism testing for monotone formulas

We investigate the complexity of finding prime implicants and minimum equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DNF related problems, the complexity of the monotone case differs strongly from the arbitrary case. We show that it is DP-complete to check whether a monomial is a prime implicant for an arbitrary formula, but the equiva...

متن کامل

Complexity of DNF and Isomorphism of Monotone Formulas

We investigate the complexity of finding prime implicants and minimal equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DNF related problems, the complexity of the monotone case strongly differs from the arbitrary case. We show that it is DP-complete to check whether a monomial is a prime implicant for an arbitrary formula, but checking p...

متن کامل

On the Complexity and Inapproximability of Shortest Implicant Problems

We investigate the complexity and approximability of a basic optimization problem in the second level of the Polynomial Hierarchy, that of nding shortest implicants. We show that the DNF variant of this problem is complete for a complexity class in the second level of the hierarchy utilizing log 2 n-limited nondeterminism. We obtain inap-proximability results for the DNF and formula variants of...

متن کامل

On k-Term DNF with the Largest Number of Prime Implicants

It is known that a k-term DNF can have at most 2k − 1 prime implicants and that this bound is sharp. We determine all k-term DNF having the maximal number of prime implicants. It is shown that a DNF is maximal if and only if it corresponds to a non-repeating decision tree with literals assigned to the leaves in a certain way. We also mention some related results and open problems.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 63  شماره 

صفحات  -

تاریخ انتشار 1998